Robust domain decomposition preconditioners for abstract symmetric positive definite bilinear forms

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Domain Decomposition Preconditioners for Abstract Symmetric Positive Definite Bilinear Forms

An abstract framework for constructing stable decompositions of the spaces corresponding to general symmetric positive definite problems into “local” subspaces and a global “coarse” space is developed. Particular applications of this abstract framework include practically important problems in porous media applications such as: the scalar elliptic (pressure) equation and the stream function for...

متن کامل

Robust Domain Decomposition Preconditioners For

An abstract framework for constructing stable decompositions of the spaces corresponding to general symmetric positive definite problems into “local” subspaces and a global “coarse” space is developed. Particular applications of this abstract framework include practically important problems in porous media applications such as: the scalar elliptic (pressure) equation and the stream function for...

متن کامل

Symmetric Positive Definite Based Preconditioners For Discrete Convection-diffusion Problems

We experimentally examine the performance of preconditioners based on entries of the symmetric positive definite part and small subspace solvers for linear system of equations obtained from the high-order compact discretization of convection-diffusion equations. Numerical results are described to illustrate that the preconditioned GMRES algorithm converges in a reasonable number of iterations.

متن کامل

Robust Multilevel Methods for General Symmetric Positive Definite Operators

An abstract robust multilevel method for solving symmetric positive definite systems resulting from discretizing elliptic partial differential equations is developed. The term “robust” refers to the convergence rate of the method being independent of discretization parameters, i.e., the problem size, and problem parameters. Important instances of such problem parameters are in particular (highl...

متن کامل

Modified Incomplete Cholesky Factorization Preconditioners for a Symmetric Positive Definite Matrix

We propose variants of the modified incomplete Cholesky factorization preconditioner for a symmetric positive definite (SPD) matrix. Spectral properties of these preconditioners are discussed, and then numerical results of the preconditioned CG (PCG) method using these preconditioners are provided to see the effectiveness of the preconditioners.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ESAIM: Mathematical Modelling and Numerical Analysis

سال: 2012

ISSN: 0764-583X,1290-3841

DOI: 10.1051/m2an/2011073